#include <iostream>
#include <cstdio>
#include <cmath>
typedef long long ll;
using namespace std;
int main() {
    ll n;
    cin>>n;
    bool flag=false;
    ll max=(ll)sqrt(2*n)+1;
    for (int i=max; i>=2; i--) {
        if (2*n%i==0) {
            if ((2*n/i+1-i)<=0) continue;
            if((2*n/i+1-i)%2==0) {
                flag=true;
                cout<<(2*n/i+1-i)/2<<endl;
            }
        }
    }
    if (!flag) cout<<"No Solution"<<endl;
    return 0;
}
